On the approximability of robust spanning tree problems

On the approximability of robust spanning tree problems

In this paper the minimum spanning tree problem with uncertain edge costs is discussed. In order to model the uncertainty a discrete scenario set is specified and a robust framework is adopted to choose a solution. The min-max, min-max regret and 2-stage min-max versions of the problem are discussed. The complexity and approximability of all these problems are explored. It is proved that the mi...

On the Complexity of the Robust Spanning Tree

The robust minimum spanning tree problem

Multi-Source Spanning Tree Problems

We consider a model of communication in a network, where multiple sources have messages to disseminate among the network membership. We propose that all the messages (one from each source) be disseminated along the same spanning tree of the network and consider the problem of constructing such a tree. One evaluative measure for suitability of the construction is the sum of distances from each s...

On the Shortest Path and the Minimum Spanning Tree Problems

2005A7TS183P, in partial fulfillment of the requirements for BITS C421T Thesis, embodies the work done by him under my supervision. Acknowledgements I am extremely grateful to my supervisor, Kiran D.C. for his unstinting help throughout the course of my thesis work. I especially wish to thank him for allowing me to work with a great deal of freedom, and for guiding and supporting me in my other...